Input Locality and Hardness Amplification
نویسندگان
چکیده
منابع مشابه
Lecture 3: Hardness Amplification
Remark 1. One may wonder why Impagliazzo’s hard core lemma (see the previous lecture for the lemma statement) is not enough to get a 12 −2 −δn-hard function starting with a 2−δn-hard function. The difficulty lies in the fact that the hard core lemma only tells about the existence of a hard core set such that on that set f is 1 2 − 2 −δn -hard. We do not know how to sample from that hard core se...
متن کاملExtractors Using Hardness Amplification
Zimand [24] presented simple constructions of locally computable strong extractors whose analysis relies on the direct product theorem for one-way functions and on the Blum-Micali-Yao generator. For N -bit sources of entropy γN , his extractor has seed O(logN) and extracts N random bits. We show that his construction can be analyzed based solely on the direct product theorem for general functio...
متن کاملSecurity Preserving Amplification of Hardness
We consider the task of transforming a weak one-way function (which may be easily inverted on all but a polynomial fraction of the range) into a strong one-way function (which can be easily inverted only on a negligible fraction of the range). The previous known transformation [Yao 82] does not preserve the security (i.e., the running-time of the inverting algorithm) within any polynomial. Its ...
متن کاملDegradation and Amplification of Computational Hardness
What happens when you use a partially defective bit-commitment protocol to commit to the same bit many times? For example, suppose that the protocol allows the receiver to guess the committed bit with advantage ε, and that you used that protocol to commit to the same bit more than 1/ε times. Or suppose that you encrypted some message many times (to many people), only to discover later that the ...
متن کاملHardness Amplification and Error Correcting Codes
We pointed out in earlier chapters (e.g., Chapter ?? the distinction between worst-case hardness and average-case hardness. For example, the problem of finding the smallest factor of every given integer seems difficult on worstcase instances, and yet is trivial for at least half the integers –namely, the even ones. We also saw that functions that are average-case hard have many uses, notably in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2011
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-011-9117-y